منابع مشابه
Estimating Temporal Exponential Random Graph Models by Bootstrapped Pseudolikelihood
This package vignette is designed as a hands-on tutorial for estimating temporal exponential random graph models (TERGMs) (Desmarais and Cranmer 2010, 2012b; Hanneke et al. 2010) and assessing goodness of fit and predictive performance (Cranmer and Desmarais 2011; Leifeld and Cranmer 2014) using the xergm package (Leifeld et al. 2014) for the statistical computing environment R (R Core Team 201...
متن کاملMixing of Random Walks and Other Diffusions on a Graph
We survey results on two diffusion processes on graphs: random walks and chip-firing (closely related to the “abelian sandpile” or “avalanche” model of self-organized criticality in statistical mechanics). Many tools in the study of these processes are common, and results on one can be used to obtain results on the other. We survey some classical tools in the study of mixing properties of rando...
متن کاملbootfs - Bootstrapped feature selection
The usage of the package is illustrated for three classification algorithms: pamr (Prediction analysis for Microarrays, [3], implementation in pamr -Rpackage), rf boruta (Random forests with the Boruta algorithm for feature selection, [2], implementation in Boruta-R-package) and scad (Support Vector Machines with Smoothly Clipped Absolute Deviation feature selection, [4], implementation in the ...
متن کاملBootstrapped synthetic likelihood
The development of approximate Bayesian computation (ABC) and synthetic likelihood (SL) techniques has enabled the use of Bayesian inference for models that may be simulated, but for which the likelihood is not available to evaluate pointwise at values of an unknown parameter θ. The main idea in ABC and SL is to, for different values of θ (usually chosen using a Monte Carlo algorithm), build es...
متن کاملDeep Exploration via Bootstrapped DQN
Efficient exploration in complex environments remains a major challenge for reinforcement learning. We propose bootstrapped DQN, a simple algorithm that explores in a computationally and statistically efficient manner through use of randomized value functions. Unlike dithering strategies such as -greedy exploration, bootstrapped DQN carries out temporally-extended (or deep) exploration; this ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Measurement and Analysis of Computing Systems
سال: 2018
ISSN: 2476-1249
DOI: 10.1145/3179413